/*
 * @lc app=leetcode.cn id=39 lang=cpp
 *
 * [39] 组合总和
 */

// @lc code=start
class Solution
{
private:
    vector<int> path;
    vector<vector<int>> res;
    void backtracking(vector<int> &candidates, int target,int index)
    {
        //组合加起来等于target
    }

public:
    vector<vector<int>> combinationSum(vector<int> &candidates, int target)
    {
        sort(candidates.begin(), candidates.end());
        backtracking(candidates, target,0);
        return res;
    }
};
// @lc code=end

